On the spectral sequence constructors of Guichardet and Stefan

The concept of a spectral sequence constructor is generalised to Hopf Galois extensions. The spectral sequence constructions that are given by Guichardet for crossed product algebras are also generalised and shown to provide examples. It is shown that all spectral sequence constructors for Hopf Galois extensions construct the same spectral sequence.     

Embedding of Dynamical Symmetry Groups U(1, 1) and U(2) of a Free Particle on AdS 2 and S 2 into Parasupersymmetry Algebra

Using two different types of the laddering equations realized simultaneously by the associated Gegenbauer functions, we show that all quantum states corresponding to the motion of a free particle on AdS ₂ and S ² are splitted into infinite direct sums of infinite-and finite-dimensional Hilbert subspaces which represent Lie algebras u(1, 1) and u(2) with infinite- and finite-fold degeneracies, respectively. In addition, it is shown that the representation bases of Lie algebras with rank 1, i.e., gl(2, C), realize the representation of nonunitary parasupersymmetry algebra of arbitrary order. The realization of the representation of parasupersymmetry algebra by the Hilbert subspaces which describe the motion of a free particle on AdS ₂ and S ² with the dynamical symmetry groups U(1, 1) and U(2) are concluded as well.     

Local automorphisms of operator algebras on Banach spaces

In this paper we extend a result of Semrl stating that every 2-local automorphism of the full operator algebra on a separable infinite dimensional Hilbert space is an automorphism. In fact, besides separable Hilbert spaces, we obtain the same conclusion for the much larger class of Banach spaces with Schauder bases. The proof rests on an analogous statement concerning the 2-local automorphisms of matrix algebras for which we present a short proof. The need to get such a proof was formulated in Semrl's paper.

     

剩余格与FI代数的可嵌入性

给出剩余格可嵌入于全序剩余格的乘积的充要条件。还给出定义在格上的FI代数可嵌入于全序FI代数的乘积的充要条件。     

Tensor Products of Quantum Structures and Their Applications in Quantum Measurements

Tensor products of quantum logics and effect algebras with some known problems are reviewed. It is noticed that although tensor products of effect algebras having at least one state exist, in the category of complex Hilbert space effect algebras similar problems as with tensor products of projection lattices occur. Nevertheless, if one of the two coupled physical systems is classical, tensor product exists and can be considered as a Boolean power. Some applications of tensor products (in the form of Boolean powers) to quantum measurements are reviewed.     

电子储存环中插入元件的非线性束流动力学的Lie代数方法

介绍了用能保证哈密顿系统“辛”性质的Lie映射方法来研究电子储存环中的插入元件对束流动力学的影响.并以此方法对合肥光源中将要安装的波荡器UD?–?1对储存环的影响作了初步的研究     

On numerical ranges and roots

Existence of the fractional powers is established in Banach algebra setting, in terms of the numerical ranges of elements involved. The behavior of the spectra and (for Hermitian ∗-algebras satisfying some additional hypotheses) the ∗-numerical range under taking these powers also is investigated.     

Separating points of measures on effect algebras

We prove the existence of separating points for every countable family of nonatomic σ-additive modular measures on a σ-complete lattice ordered effect algebra.      

Strengthened semidefinite programming bounds for codes

We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras. The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with O(n ⁷) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n ³), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s bound with the same computational complexity. Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203.